Image reconstruction by convolution with symmetrical piecewise nth-order polynomial kernels

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image reconstruction by convolution with symmetrical piecewise nth-order polynomial kernels

The reconstruction of images is an important operation in many applications. From sampling theory, it is well known that the sine-function is the ideal interpolation kernel which, however, cannot be used in practice. In order to be able to obtain an acceptable reconstruction, both in terms of computational speed and mathematical precision, it is required to design a kernel that is of finite ext...

متن کامل

Image Reconstruction by Convolution with Symmetrical Piecewise th-Order Polynomial Kernels

The reconstruction of images is an important operation in many applications. From sampling theory, it is well known that the sinc-function is the ideal interpolation kernel which, however, cannot be used in practice. In order to be able to obtain an acceptable reconstruction, both in terms of computational speed and mathematical precision, it is required to design a kernel that is of finite ext...

متن کامل

Image reconstruction with two-dimensional piecewise polynomial convolution

This paper describes two-dimensional, non-separable, piecewise polynomial convolution for image reconstruction. We investigate a two-parameter kernel with support [-2,2]x[-2,2] and constrained for smooth reconstruction. Performance reconstructing a sampled random Markov field is superior to the traditional onedimensional cubic convolution algorithm.

متن کامل

Piecewise Polynomial Kernels for Image Interpolation: A Generalization of Cubic Convolution

A well-known approach to image interpolation is cubic convolution, in which the ideal sinc function is modelled by a finite extent kernel, which consists of piecewise third order polynomials. In this paper we show that the concept of cubic convolution can be generalized. We derive kernels of up to ninth order and compare them both mutually and to cardinal splines of corresponding orders. From s...

متن کامل

Fast LIC with Piecewise Polynomial Filter Kernels

Line integral convolution (LIC) has become a well-known and popular method for visualizing vector elds. The method works by convolving a random input texture along the integral curves of the vector eld. In order to accelerate image synthesis signiicantly, an eecient algorithm has been proposed that utilizes pixel coherence in eld line direction. This algorithm, called \fast LIC", originally was...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Image Processing

سال: 1999

ISSN: 1057-7149

DOI: 10.1109/83.743854